Support for graphs of processes in a command interpreterMCDONALD, C; DIX, T. I.Software, practice & experience. 1988, Vol 18, Num 10, pp 1011-1016, issn 0038-0644Article

An efficiency preorder for processes = Un préordre efficace pour les processusARUN-KUMAR, S; HENNESSY, M.Acta informatica. 1992, Vol 29, Num 8, pp 737-760, issn 0001-5903Article

An approximate model of processor communication rings under heavy loadCOFFMAN, E. G; FLATTO, L; GILBERT, E. N et al.Information processing letters. 1997, Vol 64, Num 2, pp 61-67, issn 0020-0190Article

A Finite Equational Base for CCS with Left Merge and Communication MergeACETO, Luca; FOKKINK, Wan; INGOLFSDOTTIR, Anna et al.Lecture notes in computer science. 2006, pp 492-503, issn 0302-9743, isbn 3-540-35904-4, 12 p.Conference Paper

From ATP to timed graphs and hybrid systemsNICOLLIN, X; SIFAKIS, J; YOVINE, S et al.Acta informatica. 1993, Vol 30, Num 2, pp 181-202, issn 0001-5903Article

Etudes et mises en œuvre d'outils de vérification basée sur la bisimulation = Studies and implementations of verification tools based on disimulationBouali, Amar; Nivat, Maurice.1993, 150/160 pThesis

Specifying concurrent objects as communicating processesJAYADEV MISRA.Science of computer programming. 1990, Vol 14, Num 2-3, pp 159-184, issn 0167-6423, 26 p.Article

Performance modeling and evaluation of Java message-passing primitives on a clusterTABOADA, Guillermo L; TOURINO, Juan; DOALLO, Ramon et al.Lecture notes in computer science. 2003, pp 29-36, issn 0302-9743, isbn 3-540-20149-1, 8 p.Conference Paper

Stable families of behavioural equivalencesLIVESEY, M.Theoretical computer science. 1989, Vol 63, Num 1, pp 19-41, issn 0304-3975Article

Spécification des systèmes parallèles: le langage L et son environnement = Parallel system specification: the L-language and its environmentBEHM, P; DAGRON, N; ERMINE, F et al.Revue technique - Thomson-CSF. 1987, Vol 19, Num 2, pp 213-247, issn 0035-4279Article

A component architecture for LAM/MPISQUYRES, Jeffrey M; LUMSDAINE, Andrew.Lecture notes in computer science. 2003, pp 379-387, issn 0302-9743, isbn 3-540-20149-1, 9 p.Conference Paper

PCc/MPI: Design and implementation of a portable MPI CheckpointerSUNIL AHN; JUNGHWAN KIM; SANGYONG HAN et al.Lecture notes in computer science. 2003, pp 302-308, issn 0302-9743, isbn 3-540-20149-1, 7 p.Conference Paper

The network agnostic MPI - Scali MPI connectHUSE, Lars Paul; SAASTAD, Ole W.Lecture notes in computer science. 2003, pp 294-301, issn 0302-9743, isbn 3-540-20149-1, 8 p.Conference Paper

On compositional reasoning in the Spi-calculusBOREALE, Michele; GORLA, Daniele.Lecture notes in computer science. 2002, pp 67-81, issn 0302-9743, isbn 3-540-43366-XConference Paper

FoSSaCS'98 : foundations of software sciecnes and computation structures (Lisbon, March 28 - April 4, 1998)Nivat, Maurice.Lecture notes in computer science. 1998, issn 0302-9743, isbn 3-540-64300-1, X, 287 p, isbn 3-540-64300-1Conference Proceedings

Distributed bisimulationsCASTELLANI, I; HENNESSY, M.Journal of the Association for Computing Machinery. 1989, Vol 36, Num 4, pp 887-911, issn 0004-5411Article

On the minimal number of x operators to model regularity in fair SCCSGUESSARIAN, I; PRIESE, L.Information processing letters. 1988, Vol 29, Num 6, pp 297-300, issn 0020-0190Article

A new MPI implementation for Cray SHMEMBRIGHTWELL, Ron.Lecture notes in computer science. 2004, pp 122-130, issn 0302-9743, isbn 3-540-23163-3, 9 p.Conference Paper

Communicating processes with value-passing and assignmentsHENNESSY, M; INGOLFSDOTTIR, A.Formal aspects of computing. 1993, Vol 5, Num 5, pp 432-466, issn 0934-5043Article

A note on the characterization of weak bisimulation congruence in CCSEKMAN, J.Information and computation (Print). 1992, Vol 96, Num 1, pp 115-118, issn 0890-5401Article

A multiparameter analysis of domino tiling with an application to concurrent systemsHSU-CHUN YEN.Theoretical computer science. 1992, Vol 98, Num 2, pp 263-287, issn 0304-3975Article

Fixed points in free process algebras. IBENSON, D. B; TIURYN, J.Theoretical computer science. 1989, Vol 63, Num 3, pp 275-294, issn 0304-3975, 20 p.Article

An incompleteness results in process algebraSZALAS, A.Information processing letters. 1988, Vol 29, Num 2, pp 67-70, issn 0020-0190Article

Bisimulation of automataBENSON, D. B; BEN-SHACHAR, O.Information and computation (Print). 1988, Vol 79, Num 1, pp 60-83, issn 0890-5401Article

Trace, failure and testing equivalences for communicating processesMAIN, M. G.International journal of parallel programming. 1987, Vol 16, Num 5, pp 383-400, issn 0885-7458Article